EPGA2: memory-efficientde novoassembler: Table 1.
نویسندگان
چکیده
منابع مشابه
Genome analysis EPGA2: memory-efficient de novo assembler
Motivation: In genome assembly, as coverage of sequencing and genome size growing, most current softwares require a large memory for handling a great deal of sequence data. However, most researchers usually cannot meet the requirements of computing resources which prevent most current softwares from practical applications. Results: In this article, we present an update algorithm called EPGA2, w...
متن کاملTable of Contents Table of Contents......................................................................................................................... 1
Table of
متن کاملTable of Contents 1
On the basis of data extracted from a longterm experiment with a robotic user interface, the paper discusses prerequisites and functions of interaction rituals.
متن کاملA Distributed Hash Table for Shared Memory
Distributed algorithms for graph searching require a highperformance CPU-efficient hash table that supports find-or-put. This operation either inserts data or indicates that it has already been added before. This paper focuses on the design and evaluation of such a hash table, targeting supercomputers. The latency of find-or-put is minimized by using one-sided RDMA operations. These operations ...
متن کاملSupplemental Table S 1
Plasmids and cloning cDNA for human USP4 and USP8 was a gift from Hidde Ploegh and cDNA for USP39 was a gift from R. Medema. USP4CD (aa 296-954) and the D1 fragment (aa 296-490) of human USP4, USP39CD (aa 219-565) and USP8CD (aa 771-1118) were cloned using ligation independent cloning into pET-46 Ek/LIC vector (Novagen). The D2 fragment (aa 766-932) of USP4 was cloned into the pET-NKI b/3C (Lun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2015
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btv487